TSTP Solution File: ANA125^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ANA125^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 18:40:35 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 33 ( 7 unt; 9 typ; 0 def)
% Number of atoms : 96 ( 33 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 174 ( 23 ~; 8 |; 4 &; 131 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 22 ^ 32 !; 4 ?; 59 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
'type/realax/real': $tType ).
thf(func_def_0,type,
'type/realax/real': $tType ).
thf(func_def_1,type,
'const/realax/real_mul': 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).
thf(func_def_2,type,
'const/iterate/polynomial_function': ( 'type/realax/real' > 'type/realax/real' ) > $o ).
thf(func_def_8,type,
sK0: 'type/realax/real' > 'type/realax/real' ).
thf(func_def_9,type,
sK1: 'type/realax/real' ).
thf(func_def_11,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
sK4: 'type/realax/real' ).
thf(func_def_13,type,
sK5: ( 'type/realax/real' > 'type/realax/real' ) > 'type/realax/real' > 'type/realax/real' ).
thf(f40,plain,
$false,
inference(subsumption_resolution,[],[f39,f15]) ).
thf(f15,plain,
( ( 'const/iterate/polynomial_function' @ sK0 )
= $true ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( ( ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( sK0 @ Y0 ) @ sK1 ) )
!= $true )
& ( ( 'const/iterate/polynomial_function' @ sK0 )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f10,f12]) ).
thf(f12,plain,
( ? [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( X0 @ Y0 ) @ X1 ) )
!= $true )
& ( ( 'const/iterate/polynomial_function' @ X0 )
= $true ) )
=> ( ( ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( sK0 @ Y0 ) @ sK1 ) )
!= $true )
& ( ( 'const/iterate/polynomial_function' @ sK0 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
? [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( X0 @ Y0 ) @ X1 ) )
!= $true )
& ( ( 'const/iterate/polynomial_function' @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f9,plain,
~ ! [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( ( 'const/iterate/polynomial_function' @ X0 )
= $true )
=> ( ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( X0 @ Y0 ) @ X1 ) )
= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
~ ! [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X0 )
=> ( 'const/iterate/polynomial_function'
@ ^ [X2: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( X0 @ X2 ) @ X1 ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X0 )
=> ( 'const/iterate/polynomial_function'
@ ^ [X2: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( X0 @ X2 ) @ X1 ) ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
! [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X0 )
=> ( 'const/iterate/polynomial_function'
@ ^ [X2: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( X0 @ X2 ) @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/POLYNOMIAL_FUNCTION_RMUL_') ).
thf(f39,plain,
( ( 'const/iterate/polynomial_function' @ sK0 )
!= $true ),
inference(beta_eta_normalization,[],[f38]) ).
thf(f38,plain,
( $true
!= ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] :
( sK0
@ ( ^ [Y1: 'type/realax/real'] : Y1
@ Y0 ) ) ) ),
inference(equality_resolution,[],[f33]) ).
thf(f33,plain,
! [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( ( 'const/realax/real_mul' @ X1 @ ( X0 @ ( sK5 @ X0 @ X1 ) ) )
!= ( 'const/realax/real_mul' @ sK1 @ ( sK0 @ ( sK5 @ X0 @ X1 ) ) ) )
| ( ( 'const/iterate/polynomial_function' @ X0 )
!= $true ) ),
inference(superposition,[],[f27,f17]) ).
thf(f17,plain,
! [X0: 'type/realax/real',X1: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ X0 @ X1 )
= ( 'const/realax/real_mul' @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f2]) ).
thf(f2,axiom,
! [X0: 'type/realax/real',X1: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ X0 @ X1 )
= ( 'const/realax/real_mul' @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/realax/REAL_MUL_SYM_') ).
thf(f27,plain,
! [X0: 'type/realax/real',X1: 'type/realax/real' > 'type/realax/real'] :
( ( ( 'const/realax/real_mul' @ X0 @ ( X1 @ ( sK5 @ X1 @ X0 ) ) )
!= ( 'const/realax/real_mul' @ ( sK0 @ ( sK5 @ X1 @ X0 ) ) @ sK1 ) )
| ( ( 'const/iterate/polynomial_function' @ X1 )
!= $true ) ),
inference(beta_eta_normalization,[],[f26]) ).
thf(f26,plain,
! [X0: 'type/realax/real',X1: 'type/realax/real' > 'type/realax/real'] :
( ( ( 'const/iterate/polynomial_function' @ X1 )
!= $true )
| ( ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X0 @ ( X1 @ Y0 ) )
@ ( sK5 @ X1 @ X0 ) )
!= ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( sK0 @ Y0 ) @ sK1 )
@ ( sK5 @ X1 @ X0 ) ) ) ),
inference(negative_extensionality,[],[f25]) ).
thf(f25,plain,
! [X0: 'type/realax/real',X1: 'type/realax/real' > 'type/realax/real'] :
( ( ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X0 @ ( X1 @ Y0 ) ) )
!= ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( sK0 @ Y0 ) @ sK1 ) ) )
| ( ( 'const/iterate/polynomial_function' @ X1 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f24]) ).
thf(f24,plain,
! [X0: 'type/realax/real',X1: 'type/realax/real' > 'type/realax/real'] :
( ( $true != $true )
| ( ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X0 @ ( X1 @ Y0 ) ) )
!= ( ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( sK0 @ Y0 ) @ sK1 ) ) )
| ( ( 'const/iterate/polynomial_function' @ X1 )
!= $true ) ),
inference(constrained_superposition,[],[f16,f14]) ).
thf(f14,plain,
! [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X1 @ ( X0 @ Y0 ) ) )
= $true )
| ( ( 'const/iterate/polynomial_function' @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
! [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X1 @ ( X0 @ Y0 ) ) )
= $true )
| ( ( 'const/iterate/polynomial_function' @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f7,plain,
! [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( ( 'const/iterate/polynomial_function' @ X0 )
= $true )
=> ( ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X1 @ ( X0 @ Y0 ) ) )
= $true ) ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
! [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X0 )
=> ( 'const/iterate/polynomial_function'
@ ^ [X2: 'type/realax/real'] : ( 'const/realax/real_mul' @ X1 @ ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: 'type/realax/real' > 'type/realax/real',X1: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X0 )
=> ( 'const/iterate/polynomial_function'
@ ^ [X2: 'type/realax/real'] : ( 'const/realax/real_mul' @ X1 @ ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/POLYNOMIAL_FUNCTION_LMUL_') ).
thf(f16,plain,
( ( 'const/iterate/polynomial_function'
@ ^ [Y0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( sK0 @ Y0 ) @ sK1 ) )
!= $true ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ANA125^1 : TPTP v8.2.0. Released v7.0.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 08:00:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 % (23813)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.13/0.37 % (23814)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.13/0.37 % (23812)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.13/0.37 % (23815)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (23817)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.13/0.37 % (23815)Instruction limit reached!
% 0.13/0.37 % (23815)------------------------------
% 0.13/0.37 % (23815)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (23815)Termination reason: Unknown
% 0.13/0.37 % (23815)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (23815)Memory used [KB]: 5373
% 0.13/0.37 % (23815)Time elapsed: 0.003 s
% 0.13/0.37 % (23815)Instructions burned: 2 (million)
% 0.13/0.37 % (23815)------------------------------
% 0.13/0.37 % (23815)------------------------------
% 0.13/0.37 % (23818)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.37 % (23817)Refutation not found, incomplete strategy
% 0.13/0.37 % (23817)------------------------------
% 0.13/0.37 % (23817)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (23817)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 % (23817)Memory used [KB]: 5500
% 0.13/0.37 % (23817)Time elapsed: 0.003 s
% 0.13/0.37 % (23817)Instructions burned: 2 (million)
% 0.13/0.37 % (23817)------------------------------
% 0.13/0.37 % (23817)------------------------------
% 0.13/0.37 % (23813)Instruction limit reached!
% 0.13/0.37 % (23813)------------------------------
% 0.13/0.37 % (23813)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (23813)Termination reason: Unknown
% 0.13/0.37 % (23813)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (23813)Memory used [KB]: 5500
% 0.13/0.37 % (23813)Time elapsed: 0.005 s
% 0.13/0.37 % (23813)Instructions burned: 4 (million)
% 0.13/0.37 % (23813)------------------------------
% 0.13/0.37 % (23813)------------------------------
% 0.13/0.37 % (23816)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (23816)Instruction limit reached!
% 0.13/0.37 % (23816)------------------------------
% 0.13/0.37 % (23816)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (23816)Termination reason: Unknown
% 0.13/0.37 % (23816)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (23816)Memory used [KB]: 5500
% 0.13/0.37 % (23816)Time elapsed: 0.005 s
% 0.13/0.37 % (23816)Instructions burned: 2 (million)
% 0.13/0.37 % (23816)------------------------------
% 0.13/0.37 % (23816)------------------------------
% 0.13/0.37 % (23812)First to succeed.
% 0.13/0.37 % (23818)Also succeeded, but the first one will report.
% 0.13/0.37 % (23812)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37 % (23812)------------------------------
% 0.13/0.37 % (23812)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (23812)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (23812)Memory used [KB]: 5500
% 0.13/0.37 % (23812)Time elapsed: 0.009 s
% 0.13/0.37 % (23812)Instructions burned: 8 (million)
% 0.13/0.37 % (23812)------------------------------
% 0.13/0.37 % (23812)------------------------------
% 0.13/0.37 % (23811)Success in time 0.01 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------